Synthesis Optimization on Galois-Field Based Arithmetic Operators for Rijndael Cipher
نویسندگان
چکیده
منابع مشابه
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
We explore the use of subfield arithmetic for efficient implementations of Galois Field arithmetic especially in the context of the Rijndael block cipher. Our technique involves mapping field elements to a composite field representation. We describe how to select a representation which minimizes the computation cost of the relevant arithmetic, taking into account the cost of the mapping as well...
متن کاملAuthors : The Rijndael Block Cipher AES Proposal
After the selection of Rijndael as the AES, it was decided to change the names of some of its component functions in order to improve the readability of the standard. However, we see that many recent publications on Rijndael and the AES still use the old names, mainly because the original submission documents using the old names, are still available on the Internet. In this note we repeat quick...
متن کاملParallel Analysis of the Rijndael Block Cipher
In this paper, we present the first theoretical study of the parallelism inherent in the Rijndael Advanced Encryption Standard (AES). We derive the asymptotic sequential runtime for the algorithm and describe two parallel implementations: one that is optimal in terms of time, and another that is optimal in terms of cost (the asymptotic product of time and number of processors required). The cos...
متن کاملGroup Re - keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field
Problem statement: In this study we propose a group re-keying protocol based on modular polynomial arithmetic over Galois Field GF(2). Common secure group communications requires encryption/decryption for group re-keying process, especially when a group member is leaving the group. Approach: This study proposes secret keys multiplication protocol based on modular polynomial arithmetic (SKMP), w...
متن کاملArithmetic Operators Based on the BSCB representation
We introduce implementations of arithmetic operators based on the binary stored-carry-or-borrow (BSCB) representation. Several BSCB arithmetic elements, including full-adder, ripple-carry adder, and carry-lookahead adder are presented, followed by detailed design of an array multiplier. In the latter design, the conventional initial AND matrix is transformed and expressed with a redundant radix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITB Journal of Information and Communication Technology
سال: 2011
ISSN: 1978-3086
DOI: 10.5614/itbj.ict.2011.5.2.2